A Prolog Implementation of the Functional Uniication Grammar Formalism
نویسندگان
چکیده
This paper compares the use of Lisp and Prolog for the implementation of a functional grammar uniication system. To achieve this comparison, we have taken as a starting point Michael Elhadad's FUF system, which is written in Lisp and produced a much smaller and more eecient Prolog version (PFUF) retaining many of FUF's essential features. Our approach is based on a precompilation scheme that reduces most of the runtime overhead.
منابع مشابه
A Prolog implementation of the Functional Unification Grammar Formalism
This paper compares the use of Lisp and Prolog for the implementation of a functional grammar unification system. To achieve this comparison, we have taken as a starting point Michael Elhadad’s FUF system, which is written in Lisp and produced a much smaller and more efficient Prolog version (PFUF) retaining many of FUF’s essential features. Our approach is based on a precompilation scheme that...
متن کاملA Prolog implementation of the Functional Uni cation Grammar Formalism
This paper compares the use of Lisp and Prolog for the implementation of a func tional grammar uni cation system To achieve this comparison we have taken as a starting point Michael Elhadad s FUF system which is written in Lisp and produced a much smaller and more e cient Prolog version PFUF retaining many of FUF s essential features Our approach is based on a precompilation scheme that reduces...
متن کاملUsing Focus to Generate Complex and Simple Sentences
One problem for the generation of natural language text is determining when to use a sequence of simple sentences and when a single complex one is more appropriate. In this paper, we show how focus of attention is one factor that influences this decision and describe its implementation in a system that generates explanations for a student advisor expert system. The implementation uses tests on ...
متن کاملA Grammar Formalism and Cross-Serial Dependencies
First we deene a uniication grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism deenes a full abstract family of languages, and that it is capable of describing cross-serial dependencies of the type found in Swiss German.
متن کاملLFG System in Prolog
In order to design and maintain a latE? scale grammar, the formal system for representing syntactic knowledEe should be provided. Lexlcal Functional Grammar (LFG) [Kaplan, Bresnan 82] is a powerful formalism for that purpose, In this paper, the Prolog implementation of LFG system is described. Prolog provides a Eood tools for the implementation of LFG. LFG can be translated into DCG [Perelra,II...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994